Branch and bound
ALGORITHM FOR OPTIMIZATION PROBLEMS
Branch and Bound; Least discrepancy search; Branch-and-bound algorithm; Branch and bound algorithm; Branch-and-bound; Branch-and-bound technique
Branch and bound (BB, B&B, or BnB) is an algorithm design paradigm for discrete and combinatorial optimization problems, as well as mathematical optimization. A branch-and-bound algorithm consists of a systematic enumeration of candidate solutions by means of state space search: the set of candidate solutions is thought of as forming a rooted tree with the full set at the root.